Combinatorial optimization problems with uncertain costs and the OWA criterion
نویسندگان
چکیده
منابع مشابه
Combinatorial optimization problems with uncertain costs and the OWA criterion
In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing K distinct cost scenarios. The Ordered Weighted Averaging (OWA for short) aggregation operator is applied to choose a solution. Some well known criteria used in decision making under uncertainty such as the maximum, minimum, ...
متن کاملApproximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion
In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing K distinct cost scenarios. The Ordered Weighted Averaging (OWA for short) aggregation operator is applied to choose a solution. The well-known criteria such as: the maximum, minimum, average, Hurwicz and median are special ca...
متن کاملBottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
In this paper a class of bottleneck combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing a finite number of cost vectors, called scenarios. In order to choose a solution the Ordered Weighted Averaging aggregation operator (shortly OWA) is applied. The OWA operator generalizes traditional criteria in de...
متن کاملStandby Redundancy Optimization Problems with Uncertain Lifetimes and Uncertain Costs
Redundancy optimization problem with cost constraints is a typical problem in reliability engineering. This study investigates standby redundancy optimization problem with uncertain lifetimes and uncertain costs. Three models for optimizing different performances of a standby system are formulated. In these models, maximizing the reliability measure, maximizing the system lifetime and minimizin...
متن کاملCombinatorial optimization problems with normal random costs
We consider combinatorial optimization problems with random jointly normal costs. Target-probability efficient solutions are those that grant a given target at a certain probability and no other solution can grant the same target at a higher probability. Since the costs belong to a location-scale family the efficient solutions have a simple geometric characterization in terms of mean and varian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.11.013